Reachability Deficits in Quantum Approximate Optimization
نویسندگان
چکیده
منابع مشابه
Minimal Reachability is Hard To Approximate
In this note, we consider the problem of choosing which nodes of a linear dynamical system should be actuated so that the state transfer from the system’s initial condition to a given final state is possible. Assuming a standard complexity hypothesis, we show that this problem cannot be efficiently solved or approximated in polynomial, or even quasi-polynomial, time.
متن کاملApproximate Reachability Computation for Polynomial Systems
In this paper we propose an algorithm for approximating the reachable sets of systems defined by polynomial differential equations. Such systems can be used to model a variety of physical phenomena. We first derive an integration scheme that approximates the state reachable in one time step by applying some polynomial map to the current state. In order to use this scheme to compute all the stat...
متن کاملTemporal Planning for Compilation of Quantum Approximate Optimization Algorithm Circuits
We investigate the application of temporal planners to the problem of compiling quantum circuits to newly emerging quantum hardware. While our approach is general, we focus our initial experiments on Quantum Approximate Optimization Algorithm (QAOA) circuits that have few ordering constraints and allow highly parallel plans. We report on experiments using several temporal planners to compile ci...
متن کاملTemporal Planning for Compilation of Quantum Approximate Optimization Circuits
We investigate the application of temporal planners to the problem of compiling quantum circuits to emerging quantum hardware. While our approach is general, we focus our initial experiments on Quantum Approximate Optimization Algorithm (QAOA) circuits that have few ordering constraints and thus allow highly parallel plans. We report on experiments using several temporal planners to compile cir...
متن کاملApproximate Reachability for Dead Code Elimination in Esterel
Esterel is an imperative synchronous programming language for the design of reactive systems. Esterel extends Esterel with a noninstantaneous jump instruction (compatible with concurrency, preemption, etc.) so as to enable powerful source-to-source program transformations, amenable to formal verification. In this work, we propose an approximate reachability algorithm for Esterel and use its out...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 2020
ISSN: 0031-9007,1079-7114
DOI: 10.1103/physrevlett.124.090504